Potts model on random trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The dilute Potts model on random surfaces

We present a new solution of the asymmetric two-matrix model in the large N limit which only involves a saddle point analysis. The model can be interpreted as Ising in the presence of a magnetic field, on random dynamical lattices with the topology of the sphere (resp. the disk) for closed (resp. open) surfaces; we elaborate on the resulting phase diagram. The method can be equally well applied...

متن کامل

From Trees to Galaxies: The Potts Model on a Random Surface

The matrix model of random surfaces with c = ∞ has recently been solved and found to be identical to a random surface coupled to a qstates Potts model with q = ∞. The mean field-like solution exhibits a novel type of tree structure. The natural question is, down to which— if any—finite values of c and q does this behavior persist? In this work we develop, for the Potts model, an expansion in th...

متن کامل

9 N ov 2 00 4 Potts Model On Random Trees

We study the Potts model on locally tree-like random graphs of arbitrary degree distribution. Using a population dynamics algorithm we numerically solve the problem exactly. We confirm our results with simulations. Comparisons with a previous approach are made, showing where its assumption of uniform local fields breaks down for networks with nodes of low degree.

متن کامل

Scale-free random graphs and Potts model

We introduce a simple algorithm that constructs scale-free random graphs efficiently: each vertex i has a prescribed weight Pi ∝ i−μ (0 < μ < 1) and an edge can connect vertices i and j with rate PiPj . Corresponding equilibrium ensemble is identified and the problem is solved by the q → 1 limit of the q-state Potts model with inhomogeneous interactions for all pairs of spins. The number of loo...

متن کامل

Sampling in Potts Model on Sparse Random Graphs

We study the problem of sampling almost uniform proper q-colorings in sparse Erdős-Rényi random graphs G(n, d/n), a research initiated by Dyer, Flaxman, Frieze and Vigoda [2]. We obtain a fully polynomial time almost uniform sampler (FPAUS) for the problem provided q > 3d + 4, improving the current best bound q > 5.5d [6]. Our sampling algorithm works for more generalized models and broader fam...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment

سال: 2005

ISSN: 1742-5468

DOI: 10.1088/1742-5468/2005/02/p02006